/*
 * This file is part of the Computer Vision Toolkit (cvkit).
 *
 * Author: Heiko Hirschmueller
 *
 * Copyright (c) 2020 Roboception GmbH
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 * 1. Redistributions of source code must retain the above copyright notice,
 * this list of conditions and the following disclaimer.
 *
 * 2. Redistributions in binary form must reproduce the above copyright notice,
 * this list of conditions and the following disclaimer in the documentation
 * and/or other materials provided with the distribution.
 *
 * 3. Neither the name of the copyright holder nor the names of its contributors
 * may be used to endorse or promote products derived from this software without
 * specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 */

#include "barrier.h"
#include "thread.h"

#include <pthread.h>
#include <assert.h>

namespace gutil
{

struct BarrierData
{
  int count;
  pthread_barrier_t barrier;
};

Barrier::Barrier(int c)
{
  p=new BarrierData();

  p->count=c;
  if (p->count < 1)
  {
    p->count=Thread::getMaxThreads();
  }

#ifndef NDEBUG
  int err=
#endif
    pthread_barrier_init(&(p->barrier), 0, p->count);

  assert(!err);
}

Barrier::~Barrier()
{
  pthread_barrier_destroy(&(p->barrier));
  delete p;
}

void Barrier::reinit(int c)
{
#ifndef NDEBUG
  int err=
#endif
    pthread_barrier_destroy(&(p->barrier));

  assert(!err);

  p->count=c;
  if (p->count < 1)
  {
    p->count=Thread::getMaxThreads();
  }

#ifndef NDEBUG
  err=
#endif
    pthread_barrier_init(&(p->barrier), 0, p->count);

  assert(!err);
}

int Barrier::getCount()
{
  return p->count;
}

void Barrier::wait()
{
  pthread_barrier_wait(&(p->barrier));
}

}
